On Shift Radix Systems over Imaginary Quadratic Euclidean Domains

نویسندگان

  • Attila Pethö
  • Péter Varga
  • Mario Weitzer
چکیده

In this paper we generalize the shift radix systems to finite dimensional Hermitian vector spaces. Here the integer lattice is replaced by the direct sum of imaginary quadratic Euclidean domains. We prove in two cases that the set of one dimensional Euclidean shift radix systems with finiteness property is contained in a circle of radius 0.99 around the origin. Thus their structure is much simpler than the structure of analogous sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonadjacent Radix-τ Expansions of Integers in Euclidean Imaginary Quadratic Number Fields

In the seminal papers [6, 7], Koblitz curves were proposed for cryptographic use. For fast operations on these curves, these papers also initiated a study of the radix-τ expansion of integers in the number fields Q( √ −3) and Q( √ −7). The (window) nonadjacent form of τ -expansion of integers in Q( √ −7) was first investigated in [11]. For integers in Q( √ −3), the nonadjacent form and the wind...

متن کامل

Euclidean Ideals in Quadratic Imaginary Fields

— We classify all quadratic imaginary number fields that have a Euclidean ideal class. There are seven of them, they are of class number at most two, and in each case the unique class that generates the class-group is moreover norm-Euclidean.

متن کامل

Euclidean Ideals in Quadratic

— We classify all quadratic imaginary number fields that have a Euclidean ideal class. There are seven of them, they are of class number at most two, and in each case the unique class that generates the class-group is moreover norm-Euclidean.

متن کامل

Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings

We prove lower bounds for the complexity of deciding several relations in imaginary, normEuclidean quadratic integer rings, where computations are assumed to be relative to a basis of piecewise-linear operations. In particular, we establish lower bounds for deciding coprimality in these rings, which yield lower bounds for gcd computations. In each imaginary, norm-Euclidean quadratic integer rin...

متن کامل

Elliptic Curve Point Multiplication

New type of elliptic curve point multiplication is proposed, where complex multiplication by 2 − or by 2 ) 7 1 ( − ± is used instead of point duplication. This allows speeding up multiplication about 1.34 times. Using higher radix makes it possible to use one point duplication instead of two and to speed-up computation about 1.6 times. The method takes prime group order factorization: ρ ρ = r a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Acta Cybern.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2015